MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS
نویسندگان
چکیده
منابع مشابه
Steepest Ascent Tariff Reforms
This paper introduces the concept of a steepest ascent tariff reform for a small open economy. By construction, it is locally optimal in that it yields the highest gain in utility of any feasible tariff reform vector of the same length. Accordingly, it provides a convenient benchmark for the evaluation of the welfare effectiveness of other tariff reform proposals. We develop the properties of t...
متن کاملSteepest Ascent for Large - Scale Linear Programs
Many structured large-scale linear programming problems can be transformed into an equivalent problem of maximizing a piecewise linear, concave function subject to linear constraints. The equivalent problem can, in turn, be solved in a finite number of steps using a steepest ascent algorithm. This principle is applied to block diagonal systems yielding refinements of existing algorithms. An app...
متن کاملMonotonicity of Sequences Involving Convex and Concave Functions
Let f be an increasing and convex (concave) function on [0, 1) and φ a positive increasing concave function on [0,∞) such that φ(0) = 0 and the sequence { φ(i+1) ( φ(i+1) φ(i) − 1 )} i∈N decreases ( the sequence { φ(i) ( φ(i) φ(i+1) − 1 )} i∈N increases ) . Then the sequence { 1 φ(n) ∑n−1 i=0 f ( φ(i) φ(n) )} n∈N is increasing. Mathematics subject classification (2000): 26D15, 26A51.
متن کاملOn Steepest Descent Algorithms for Discrete Convex Functions
This paper investigates the complexity of steepest descent algorithms for two classes of discrete convex functions, M-convex functions and L-convex functions. Simple tie-breaking rules yield complexity bounds that are polynomials in the dimension of the variables and the size of the effective domain. Combination of the present results with a standard scaling approach leads to an efficient algor...
متن کاملQuasi-Concave Functions and Greedy Algorithms
Many combinatorial optimization problems can be formulated as: for a given set system over E (i.e., for a pair (E, ) where ⊆ 2E is a family of feasible subsets of finite set E), and for a given function F : →R, find an element of for which the value of the function F is minimum or maximum. In general, this optimization problem is NP-hard, but for some specific functions and set systems the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2015
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.58.184